Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
نویسندگان
چکیده
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics de-ned originally by Gelfond and Lifschitz GL88]. In this paper we describe a procedure to compute the collection of all partial stable models of an extended disjunctive logic program. This procedure consists in transforming an extended disjunctive logic program into a constrained disjunctive program free of negation-by-default whose set of 2-valued minimal models corresponds to the set of partial stable models of the original program.
منابع مشابه
Stable Generated Models, Partial Temporal Logic and Disjunctive Defaults
Stable generated models for extended generalized logic programs with two kinds of negation provide a semantics for logic programming in its (up to now) most general form. We show that stable generated semantics for extended logic programs coincides with the semantics obtained by translating programs into a minimal partial temporal logic. Then we introduce several new versions of (disjunctive) d...
متن کاملBack and Forth Semantics for Normal, Disjunctive and Extended Logic programs
We deene a logical semantics called back-and-forth, applicable to normal and disjunctive datalog programs as well as to programs possessing a second, explicit or`strong' negation operator. We show that on normal programs it is equivalent to the well-founded semantics (WFS), and that on disjunctive programs it is equivalent to the P-stable semantics of Eiter, Leone and Saccc a, hence to Przymusi...
متن کاملGenerated Models and Extensions of Nonmonotonic Systems
Stable generated models provide a general semantics for logic programming. Although equal for normal programs, they diier from the answer set semantics on disjunctive programs. We show that stable generated semantics coincide with the semantics obtained by translating programs into a minimal partial temporal logic into which a subsystem of default logic can be embedded. This leads us to a new v...
متن کاملCharacterizations of the Stable Semanticsby Partial
There are three most prominent semantics deened for certain subclasses of disjunctive logic programs: GCWA (for positive programs), PERFECT (for stratiied programs) and STABLE (deened for the whole class of all disjunctive programs). While there are various competitors based on 3-valued models, notably WFS and its disjunctive counterparts, there are no other semantics consisting of 2-valued mod...
متن کاملStability, Supportedness, Minimality and Kleene Answer Set Programs
Answer Set Programming is a widely known knowledge representation framework based on the logic programming paradigm that has been extensively studied in the past decades. The semantic framework for Answer Set Programs is based on the use of stable model semantics. There are two characteristics intrinsically associated with the construction of stable models for answer set programs. Any member of...
متن کامل